Energy-Efficient Modular Exponential Techniques for Public-Key Cryptography by Satyanarayana Vollala & N. Ramasubramanian & Utkarsh Tiwari

Author:Satyanarayana Vollala & N. Ramasubramanian & Utkarsh Tiwari
Language: eng
Format: epub
ISBN: 9783030745240
Publisher: Springer International Publishing

Buses: Interconnecting buses are responsible for transferring the data between FUs. The number of buses can vary for different TTAs.

There is a vast variety of TTA configurations are available we need an exploring device to find the best suitable TTA for our application. The explorer should be capable of examining and assessing the running time, size and power utilization of a vast number of TTAs available (Hamalainen et al. 2005).

5.7 Cox-Rower Architecture

The motive behind designing the cox-rower architecture is the efficient implementation of Residue Number System (RNS) Montgomery multiplication. cox-rower is comprised of two separate but interconnected units. The cox is unit is typically a 7-bit adder and rower unit is a single-precision modular multiplier-and-accumulator.

RNS and Montgomery multiplication algorithms are combined to overcome the disadvantage of RNS i.e., RNS is efficient with addition, subtraction and multiplication but consumes time when it comes to division and comparison, whereas the Montgomery algorithm smartly avoids the division process by changing radix representation which helps to effectively avoid division difficulties faced by RNS system.

Cox-Rower architecture targets the RNS representation method because it has an advantage that calculation of each RNS element can be carried out individually i.e., n processing elements can speed up the process by a factor of n.

Some examples for Cox-Rower Architecture implementation for modular multiplication (MM) are:Architecture given by Shinichi Kawamura et al. capable of executing RNS based Montgomery multiplication. This architecture supports the base extension algorithm to run in parallel by multiple Rower units which are govern by the Cox unit (Kawamura et al. 2000). The rower unit responsible for executing single-precision MM and accumulation, and the Cox unit is responsible for adding 7-bit at a time. The base extension algorithm running in parallel enables the conversion of RNS to radix and radix to RNS efficiently. Therefore this is capable of handling the existing radix algorithm of RSA cryptography.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.